Core Stability of Minimum Coloring Games
نویسندگان
چکیده
In cooperative game theory, a characterization of games with stable cores is known as one of the most notorious open problems. We study this problem for a special case of the minimum coloring games, introduced by Deng, Ibaraki & Nagamochi, which arises from a cost allocation problem when the players are involved in conflict. In this paper, we show that the minimum coloring game on a perfect graph has a stable core if and only if every vertex of the graph belongs to a maximum clique. We also consider the problem on the core largeness, the extendability, and the exactness of minimum coloring games. As a consequence, we show that it is coNP-complete to decide whether a given game has a large core, is extendable, or is exact.
منابع مشابه
Submodularity of Some Classes of Combinatorial Optimization Games
Some situations concerning cost allocation are formulated as combinatorial optimization games. We consider a minimum coloring game and a minimum vertex cover game. For a minimum coloring game, Deng{Ibaraki{Nagamochi 1] showed that deciding the core nonemptiness of a given minimum coloring game is NP-complete, which implies that a good characterization of balanced minimum coloring games is unlik...
متن کاملSubmodularity of some classes of the combinatorial optimization games
Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games. These characterizations immediately show that it can be decided in polynomial time that the minimum coloring game or the minimum vertex cover game on a given graph is submodular ...
متن کاملGreedy Algorithms for the Minimum Sum Coloring Problem
In this paper we present our study of greedy algorithms for solving the minimum sum coloring problem (MSCP). We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the graph coloring problem (GCP): DSATUR [1] and RLF [2].
متن کاملA reconsideration of the Kar solution for minimum cost spanning tree problems
Minimum cost spanning tree (mcst) problems try to connect agents effi ciently to a source when agents are located at different points in space and the cost of using an edge is fixed. The application of the Shapley value to the stand-alone cost game, known in this context as the Kar solution, has been criticized for sometimes proposing allocations that are outside of the core. I show that the si...
متن کامل